A Note on Aggregation and Disaggregation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on local and global convergence analysis of iterative aggregation-disaggregation methods

The purpose of the paper is to present some convergence properties of the iterative aggregation-disaggregation method for computing a stationary probability distribution vector of a column stochastic matrix. A sufficient condition for the local convergence property and the corresponding rate of convergence are established. Some global convergence considerations are presented. Several illustrati...

متن کامل

Iterative aggregation: disaggregation methods and ordering algorithms

The paper presents some modifications of two-level methods for computing stationary probability distribution vector of large discrete time Markov chains. The approach considered is an iterative aggregation disaggregation method. Two types of permuting the events are considered in order to improve the convergence.

متن کامل

A note on permutations and rank aggregation

In this brief note we consider rank aggregation, a popular method in voting theory, social choice, business decisions etc. Mathematically the problem is to find a permutation – viewed as a vector – that minimizes the sum of the `1-distances to a given family of permutations. The problem may be solved as an assignment problem and we establish several properties of optimal solutions in this problem.

متن کامل

Dynamic feedback in an aggregation-disaggregation model.

We study an aggregation-disaggregation model which is relevant to biological processes such as the growth of senile plaques in Alzheimer disease. In this model, during the aggregation each deposited particle has a probability of producing a new particle in its vicinity, while during disaggregation the particles are anihilated randomly. The model is held in a dynamic equilibrium by a feedback me...

متن کامل

A note on constrained OWA aggregation

Yager considered the problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities and he showed how this problem can be modelled as a mixed integer linear programming problem. In this short communication we show a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Econometrica

سال: 1979

ISSN: 0012-9682

DOI: 10.2307/1910419